A note on transitive orientations with maximum sets of sources and sinks
نویسندگان
چکیده
منابع مشابه
A note on transitive orientations with maximum sets of sources and sinks
Given a transitive orientation ~ G of a comparability graph G, a vertex of G is a source (sink) if it has indegree (outdegree) zero in ~ G, respectively. A source set of G is a subset of vertices formed by sources of some transitive orientation of G. A pair of subsets S; T V (G) is a source-sink pair of G when the vertices of S and T are sources and sinks, respectively, of some transitive orien...
متن کاملOn transitive orientations with restricted covering graphs
We consider the problem of finding a transitive orientation of a comparability graph, such that the edge set of its covering graph contains a given subset of edges. We propose a solution which employs the classical technique of modular tree decomposition. The method leads to a polynomial time algorithm to construct such an orientation or report that it does not exist. © 2006 Elsevier B.V. All r...
متن کاملOn transitive soft sets over semihypergroups
The aim of this paper is to initiate and investigate new soft sets over semihypergroups, named special soft sets and transitive soft sets and denoted by $S_{H}$ and $T_{H},$ respectively. It is shown that $T_{H}=S_{H}$ if and only if $beta=beta^{*}.$ We also introduce the derived semihypergroup from a special soft set and study some properties of this class of semihypergroups.
متن کاملa comparison of teachers and supervisors, with respect to teacher efficacy and reflection
supervisors play an undeniable role in training teachers, before starting their professional experience by preparing them, at the initial years of their teaching by checking their work within the proper framework, and later on during their teaching by assessing their progress. but surprisingly, exploring their attributes, professional demands, and qualifications has remained a neglected theme i...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2002
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(01)00283-9